Decreasing the Displacements of a Composite Saddle-Shaped Cable Roof

The structural possibilities of decreasing the compliance of a composite saddle-shaped cable roof having a compliant support contour are investigated. The use of a supporting contour consisting of cables joined together with tie-bars is considered as a structural method enabling one to decrease the compliance of the roof. Each cable of the support has its own initial flexure. The method is most efficient from the viewpoint of material consumption per unit of covered area relative to the increasing rigidity and prestress level of the cable net.The efficiency of the method was evaluated by a numerical experiment, which was carried out for a composite saddle-shaped cable roof 50 × 50 m in the plan. The roof was formed by two orthogonal cable groups joined with a compliant supporting contour. A hybrid composite cable based on a carbon-fiber-reinforced plastic, a glass-fiber-reinforced plastic, and steel was considered as a material for the cable net in combination with steel. The material consumption and the maximum vertical displacement of the cable net in relation to the initial geometrical characteristics of the supporting contour were obtained. A possibility of decreasing the maximum vertical displacements of the roof by 8% was established.     

The interlace polynomial of a graph

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers.     

完全k-致超图的k团分划

 作为完全图的最优完全二部图分解的推广,引进了完全k一致超图的最优k团分划的新概念;并对k=3推广了Graham-Pollak定理,给出了这种情形的特性;同时,对一般情形给出了最优k团分划的一个上界.     

一类广义向量拟均衡问题

提出一类新型的广义向量拟均衡问题。利用连续单位分解定理和数值化方法，在连续性条件较弱、定义域无界等情况下，得到解的存在性定理。     

Improper Riemann Integral and Henstock Integral in ℝn

The Henstock integral in ℝⁿ and its relation to the n-dimensional improper Riemann integral are studied. A Hake-type theorem for the Henstock integral in ℝⁿ is proved.__________Translated from Matematicheskie Zametki, vol. 78, no. 2, 2005, pp. 251–258.Original Russian Text Copyright © 2005 by P. Muldowney, V. A. Skvortsov.     

Two-dimensional four-line models of the Ising model type

We briefly describe the theory of root transfer matrices for four-line models with the field in the new indexless form. We use theoretical and numerical methods to reveal new effects in the theory of singular points and phase transitions. A substantial part of the results is obtained using a numerical algorithm that drastically (at least exponentially) reduces the computational complexity of Ising-type models by using the extremely sparse root transfer matrix. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 149, No. 2, pp. 281–298, November, 2006.     

Cn空间中光滑函数的一种积分表示

应用单位分解的观点及核函数的构造理论，得到C^n空间中有界域上光滑函数的一种积分表示，根据这一积分表示，可以得到多复变数光滑函数至今已有的许多积分公式以及它们的拓广式。     

Several parameters of generalized Mycielskians

The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μ_m(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μ_m(G).     

多维耦合受迫量子谐振子的普遍解

运用广义线性量子变换的普遍理论求解多维耦合受迫量子谐振子，给出了系统演化算符的矩阵元、波函数、力学量期望值和配分函数的严格表达式. 关键词： 多维耦合受迫量子谐振子 演化算符矩阵元 配分函数     

Maximin share and minimax envy in fair-division problems

For fair-division or cake-cutting problems with value functions which are normalized positive measures (i.e., the values are probability measures) maximin-share and minimax-envy inequalities are derived for both continuous and discrete measures. The tools used include classical and recent basic convexity results, as well as ad hoc constructions. Examples are given to show that the envy-minimizing criterion is not Pareto optimal, even if the values are mutually absolutely continuous. In the discrete measure case, sufficient conditions are obtained to guarantee the existence of envy-free partitions.